Advances on C-Planarity Testing of Extrovert C-Graphs
نویسندگان
چکیده
The problem of testing c-planarity of cgraphs is unknown to be NP-complete or in P. Previous work solved this problem on some special classes of c-graphs. In particular, Goodrich, Lueker, and Sun tested c-planarity of extrovert c-graphs in O(n) time [5]. In this paper, we improve the time complexity of the testing algorithm in [5] to O(n).
منابع مشابه
C-Planarity of Extrovert Clustered Graphs
A clustered graph has its vertices grouped into clusters in a hierarchical way via subset inclusion, thereby imposing a tree structure on the clustering relationship. The c-planarity problem is to determine if such a graph can be drawn in a planar way, with clusters drawn as nested regions and with each edge (drawn as a curve between vertex points) crossing the boundary of each region at most o...
متن کاملAdvances in C-Planarity Testing of Clustered Graphs
A clustered graph C = (G; T ) consists of an undirected graph G and a rooted tree T in which the leaves of T correspond to the vertices of G = (V;E). Each vertex c in T corresponds to a subset of the vertices of the graph called \cluster". c-planarity is a natural extension of graph planarity for clustered graphs, and plays an important role in automatic graph drawing. The complexity status of ...
متن کاملAdvances on Testing C-Planarity of Embedded Flat Clustered Graphs
We show a polynomial-time algorithm for testing c-planarity of embedded flat clustered graphs with at most two vertices per cluster on each face.
متن کاملClustered Graphs and C-planarity
In this paper, we introduce a new graph model known as clustered graphs, i.e. graphs with recursive clustering structures. This graph model has many applications in informational and mathematical sciences. In particular, we study C-planarity of clustered graphs. Given a clustered graph, the C-planarity testing problem is to determine whether the clustered graph can be drawn without edge crossin...
متن کاملEfficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces
Let C be a clustered graph and suppose that the planar embedding of its underlying graph is fixed. Is testing the c-planarity of C easier than in the variable embedding setting? In this paper we give a first contribution towards answering the above question. Namely, we characterize c-planar embedded flat clustered graphs with at most five vertices per face and give an efficient testing algorith...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008